Haar transform

См. также в других словарях:

• Haar transform — The Haar transform is the simplest of the wavelet transforms. This transform cross multiplies a function against the Haar wavelet with various shifts and stretches, like the Fourier transform cross multiplies a function against a sine wave with… …   Wikipedia

• Haar wavelet — ] >The Haar wavelet is the first known wavelet and was proposed in 1909 by Alfréd Haar [Haar, Alfred; Zur Theorie der orthogonalen Funktionensysteme. (German) Mathematische Annalen 69 (1910), no. 3, 331 371.] . Haar used these functions to give… …   Wikipedia

• Wavelet de Haar — En matemáticas, el wavelet de Haar es una cierta secuencia de funciones. Ahora se le reconoce como el primer wavelet conocido. Esta secuencia fue propuesta en 1909 por Alfred Haar. Haar usó estas funciones para dar un ejemplo de un sistema… …   Wikipedia Español

• Alfréd Haar — (October 11, 1885 March 16, 1933) was a Hungarian mathematician. The Haar measure, Haar wavelet, and Haar transform are named in his honor. Together with Frigyes Riesz, he made the University of Szeged a centre of mathematics.PublicationHaar A.… …   Wikipedia

• Stationary wavelet transform — Haar Stationary Wavelet Transform of Lena The Stationary wavelet transform (SWT)[1] is a wavelet transform algorithm designed to overcome the lack of translation invariance of the discrete wavelet transform (DWT). Translation invariance is… …   Wikipedia

• Discrete wavelet transform — An example of the 2D discrete wavelet transform that is used in JPEG2000. The original image is high pass filtered, yielding the three large images, each describing local changes in brightness (details) in the original image. It is then low pass… …   Wikipedia

• Mellin transform — In mathematics, the Mellin transform is an integral transform that may be regarded as the multiplicative version of the two sided Laplace transform. This integral transform is closely connected to the theory of Dirichlet series, and is often used …   Wikipedia

• Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …   Wikipedia

• Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm …   Wikipedia

• Scale-invariant feature transform — Exemple de résultat de la comparaison de deux images par la méthode SIFT (Fantasia ou Jeu de la poudre, devant la porte d’entrée de la ville de Méquinez, par Eug …   Wikipédia en Français

• преобразование Хаара — Метод группового кодирования изображений, основанный на использовании ортогональной матрицы Хаара (табл. Н 2). Преобразование Хаара можно рассматривать как процесс дискретизации с переменным шагом, зависящим от разности яркостных компонент… …   Справочник технического переводчика